Effective Computation of Immersion Obstructions for Unions of Graph Classes
نویسندگان
چکیده
In the final paper of the Graph Minors series N. Robertson and P. Seymour proved that graphs are well-quasi-ordered under the immersion ordering. A direct implication of this theorem is that each class of graphs that is closed under taking immersions can be fully characterized by forbidding a finite set of graphs (immersion obstruction set). However, as the proof of the well-quasi-ordering theorem is nonconstructive, there is no generic procedure for computing such a set. Moreover, it remains an open issue to identify for which immersionclosed graph classes the computation of those sets can become effective. By adapting the tools that were introduced by I. Adler, M. Grohe and S. Kreutzer, for the effective computation of minor obstruction sets, we expand the horizon of computability to immersion obstruction sets. In particular, our results propagate the computability of immersion obstruction sets of immersion-closed graph classes to immersion obstruction sets of finite unions of immersion closed graph classes.
منابع مشابه
4-Prime cordiality of some classes of graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1....
متن کاملOn computing graph minor obstruction sets
The Graph Minor Theorem of Robertson and Seymour establishes nonconstructively that many natural graph properties are characterized by a nite set of forbidden substructures, the obstructions for the property. We prove several general theorems regarding the computation of obstruction sets from other information about a family of graphs. The methods can be adapted to other partial orders on graph...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملOn Realizing Homology Classes by Maps of Restricted Complexity
We show that in every codimension greater than one there exists a mod 2 homology class in some closed manifold (of sufficiently high dimension) which cannot be realized by an immersion of closed manifolds. The proof gives explicit obstructions (in terms of cohomology operations) for realizability of mod 2 homology classes by immersions. We also prove the corresponding result in which the word ‘...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کامل